Visualizing the Pareto Frontier
نویسندگان
چکیده
We describe techniques for visualizing the Pareto optimal set that can be used if the multiobjective optimization problem considered has more than two objective functions. The techniques discussed can be applied in the framework of both MCDM and EMO approaches. First, lessons learned from methods developed for biobjective problems are considered. Then, visualization techniques for convex multiobjective optimization problems based on a polyhedral approximation of the Pareto optimal set are discussed. Finally, some visualization techniques are considered that use a pointwise approximation of the Pareto optimal set.
منابع مشابه
Intuitive Visualization of Pareto Frontier for Multi- Objective Optimization in n-Dimensional Performance Space
A visualization methodology is presented in which a Pareto Frontier can be visualized in an intuitive and straightforward manner for an n-dimensional performance space. Based on this visualization, it is possible to quickly identify ‘good’ regions of the performance and optimal design spaces for a multi-objective optimization application, regardless of space complexity. Visualizing Pareto solut...
متن کاملAn effective method based on the angular constraint to detect Pareto points in bi-criteria optimization problems
The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملA decomposition method for approximating Pareto frontier in Multiobjective Integer Linear Problems
where x is an n-dimensional vector of variables, A is an m × n matrix, b is the RHS vector and the vectors ci (i = 1, ...,m) represent the coefficients of the objective functions (criteria). Let’s denote yi = fi(x), i = 1, ...,m, and let y = (y1, ..., ym) be a vector in the criteria space. The set Y ⊂ Rm composed by all possible criterion vectors y = f(x) when x ∈ X, is known as Feasible Criter...
متن کاملCase Studies in Concept Exploration and Selection with s-Pareto Frontiers
This paper investigates three disparate design cases where the newly developed s-Pareto frontier based concept selection paradigm is used to compare competing design concepts under a multiobjective optimization framework. The new paradigm, which was recently introduced by the authors, is based on the principle of Pareto optimality – a principle that defines an important class of optimal solutio...
متن کامل